close to convex function

См. также в других словарях:

• Convex function — on an interval. A function (in black) is convex if and only i …   Wikipedia

• Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find …   Wikipedia

• Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a …   Wikipedia

• Gamma function — For the gamma function of ordinals, see Veblen function. The gamma function along part of the real axis In mathematics, the gamma function (represented by the capital Greek letter Γ) is an extension of the factorial function, with its… …   Wikipedia

• List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

• List of real analysis topics — This is a list of articles that are considered real analysis topics. Contents 1 General topics 1.1 Limits 1.2 Sequences and Series 1.2.1 Summation Methods …   Wikipedia

• Stress majorization — is an optimization strategy used in multidimensional scaling (MDS) where, for a set of n , m dimensional data items, a configuration X of n points in r( …   Wikipedia

• Maximum principle — This article describes the maximum principle in the theory of partial differential equations. For the maximum principle in optimal control theory, see Pontryagin s minimum principle. In mathematics, the maximum principle is a property of… …   Wikipedia

• Derivative — This article is an overview of the term as used in calculus. For a less technical overview of the subject, see Differential calculus. For other uses, see Derivative (disambiguation) …   Wikipedia

• Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… …   Wikipedia

• Rao–Blackwell theorem — In statistics, the Rao–Blackwell theorem is a result which characterizes the transformation of an arbitrarily crude estimator into an estimator that is optimal by the mean squared error criterion or any of a variety of similar criteria. The Rao… …   Wikipedia